Farthest-point queries with geometric and combinatorial constraints
نویسندگان
چکیده
منابع مشابه
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log2 n) time. Our data structure needs O(n logn) space and preprocessing time. To the best of our kno...
متن کاملEfficient Farthest-Point Queries in Two-terminal Series-parallel Networks
Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce a data structure supporting queries for the farthest distan...
متن کاملOptimal Data Structures for Farthest-Point Queries in Cactus Networks
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest di...
متن کاملThe Farthest Spatial Skyline Queries
Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or “not dominated.” Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More spec...
متن کاملNetwork Farthest-Point Diagrams
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points—and the distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2006
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2005.07.002